public class 统计子矩阵 { //max[k][i][j]表示第k列中[i,j]之间的最大值 static int[][][] max; static int[][][] min; static int n, m, limit,ans; static BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out)); public static void main(String[] args) throws IOException { String[] s=br.readLine().split(" "); n = Integer.parseInt(s[0]); m = Integer.parseInt(s[1]); max=new int[m+1][n+1][n+1]; min=new int[m+1][n+1][n+1]; for (int i = 1; i